A dynamic programming approach for storage location assignment planning problem
نویسندگان
چکیده
منابع مشابه
A genetic algorithm approach for a dynamic cell formation problem considering machine breakdown and buffer storage
Cell formation problem mainly address how machines should be grouped and parts be processed in cells. In dynamic environments, product mix and demand change in each period of the planning horizon. Incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. In this model, to ensure the reliability of the system in presence of unreliable machine...
متن کاملA Fuzzy Multi-Objective Class Based Storage Location Assignment
The required storage space and the material handing cost in a warehouse hinge on the storage implementation decision. Effects of storage area reduction on order picking and storage space cost are incorporated. Moreover, merchandises which are in the same shape and can be stored beside each other easily or goods that don't cause any danger like causing a fire if be in touch with each other, ...
متن کاملAn Integrated Model for Storage Location Assignment and Storage/Retrieval Scheduling in AS/RS system
An integrated optimization framework, including location assignment under grouping class-based storage policy and schedule of dual shuttle cranes, is offered by presenting a new optimization programming model. The objective functions, which are considered at this level, are the minimization of total costs and energy consumption. Scheduling of dual shuttle cranes among specified locations, which...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia CIRP
سال: 2019
ISSN: 2212-8271
DOI: 10.1016/j.procir.2019.04.113